Probabilistic Assertions: Extended Semantics and Proof
نویسندگان
چکیده
This section formalizes a simple probabilistic imperative language, ProbCore, and Mayhap’s distribution extraction process. We describe ProbCore’s syntax, a concrete semantics for nondeterministic run-time execution, and a symbolic semantics for distribution extraction. Executing a ProbCore program under the symbolic semantics produces a Bayesian network for a passert statement. We prove this extracted distribution is equivalent to the original program under the concrete semantics, demonstrating the soundness of Mayhap’s core analysis.
منابع مشابه
Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus
We extend the simply-typed guarded λ-calculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic computations. This provides a framework for programming and reasoning about infinite stochastic processes like Markov chains. We demonstrate the logic sound by interpreting its judgements in the topos of trees and by using...
متن کاملVPHL: A Verified Partial-Correctness Logic for Probabilistic Programs
We introduce a Hoare-style logic for probabilistic programs, called VPHL, that has been formally verified in the Coq proof assistant. VPHL features propositional, rather than additive, assertions and a simple set of rules for reasoning about these assertions using the standard axioms of probability theory. VPHL’s assertions are partial correctness assertions, meaning that their conclusions are ...
متن کاملVPHL: A Verified Partial-Correctness Logic for Probabilistic Programs (Expanded Version)
We introduce a Hoare-style logic for probabilistic programs, called VPHL, that has been formally verified in the Coq proof assistant. VPHL features propositional, rather than additive, assertions and a simple set of rules for reasoning about these assertions using the standard axioms of probability theory. VPHL’s assertions are partial correctness assertions, meaning that their conclusions are ...
متن کاملPALC: Extending ALC ABoxes with Probabilities
Most probabilistic extensions of description logics focus on the terminological apparatus. While some allow for expressing probabilistic knowledge about concept assertions, systems which can express probabilistic knowledge about role assertions have received very little attention as yet. We present a system PALC which allows us to express degrees of belief in concept and role assertions for ind...
متن کاملLp: A Logic for Statistical Information
This extended abstract presents a logic, called Lp, that is capable of representing and reasoning with a wide variety of both qualitative and quantitative statistical information. The advantage of this logical formalism is that it offers a declarative representation of statistical knowledge; knowledge represented in this manner can be used for a variety of reasoning tasks. The logic differs fro...
متن کامل